Terminological Cycles : Semantics and Computational

نویسنده

  • Bernhard Nebel
چکیده

Terminological knowledge representation formalisms are intended to capture the analytic relationships between terms of a vocabulary intended to describe a domain. A term whose deenition refers, either directly or indirectly, to the term itself presents a problem for most terminological representation systems because it is obvious neither whether such a term is meaningful, nor how it could be handled by a knowledge representation system in a satisfying manner. After some examples of intuitively sound terminological cycles are given, diierent formal semantics are investigated and evaluated with respect to the examples. As it turns out, none of the diierent styles of semantics seems to be completely satisfying for all purposes. Finally, consequences in terms of computational complexity and decidability are discussed.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Characterizing the semantics of terminological cycles with the help of finite automata

The representation of terminological knowledge may naturally lead to terminological cycles. In addition to descriptive semantics, the meaning of cyclic terminologies can also be captured by xed-point semantics. To gain a more profound understanding of these semantics and to obtain inference algorithms for inconsistency, subsumption , and related inference tasks, this paper provides automata the...

متن کامل

Terminological Cycles in a Description Logic with Existential Restrictions

Cyclic definitions in description logics have until now been investigated only for description logics allowing for value restrictions. Even for the most basic language which allows for conjunction and value restrictions only, deciding subsumption in the presence of terminological cycles is a PSPACE-complete problem. This paper investigates subsumption in the presence of terminological cycles fo...

متن کامل

Terminological Cycles in KL-ONE-based Knowledge Representation Languages

Cyclic definitions are often prohibited in terminological knowledge representation languages because, from a theoretical point of view, their semantics is not clear and, from a practical point of view, existing inference algorithms may go astray in the presence of cycles. In this paper, we shall consider terminological cycles in a very small KL-ONE-based language. For this language, the effect ...

متن کامل

Characterizing the Semantics of Terminological Cycles in ALN Using Finite Automata

The representation of terminological knowledge may naturally lead to terminological cycles. In addition to descriptive semantics , the meaning of cyclic terminologies can also be captured by xed-point semantics, namely, greatest and least xed-point semantics. To gain a more profound understanding of these semantics and to obtain inference algorithms as well as complexity results for inconsisten...

متن کامل

A Re ned Architecturefor Terminological Systems : Terminology = Schema +

Traditionally, the core of a Terminological Knowledge Representation System (TKRS) consists of a TBox or terminology, where concepts are introduced, and an ABox or world description, where facts about individuals are stated in terms of concept memberships. This design has a drawback because in most applications the TBox has to meet two functions at a time: On the one hand|similarly to a databas...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1991